Root-finding by expansion with independent constraints
نویسندگان
چکیده
منابع مشابه
Root finding with threshold circuits
We show that for any constant d, complex roots of degree d univariate rational (or Gaussian rational) polynomials—given by a list of coefficients in binary—can be computed to a given accuracy by a uniform TC algorithm (a uniform family of constant-depth polynomial-size threshold circuits). The basic idea is to compute the inverse function of the polynomial by a power series. We also discuss an ...
متن کاملModel independent constraints on the cosmological expansion rate
We investigate what current cosmological data tells us about the cosmological expansion rate in a model independent way. Specifically, we study if the expansion was decelerating at high redshifts and is accelerating now, without referring to any model for the energy content of the universe, nor to any specific theory of gravity. This differs from most studies of the expansion rate which, e.g., ...
متن کاملAnswer Finding Guided by Question Semantic Constraints
As part of the task of automated question answering from a large collection of text documents, the reduction of the search space to a smaller set of document passages that are actually searched for answers constitutes a difficult but rewarding research issue. We propose a set of precision-enhancing filters for passage retrieval based on semantic constraints detected in the submitted questions. ...
متن کاملTR-2006007: Root-Finding with Eigen-Solving
We survey and extend the recent progress in polynomial root-finding based on reducing the problem to eigen-solving for highly structured generalized companion matrices. In particular we cover the selection of the eigen-solvers and the matrices and the resulting benefits based on exploiting matrix structure. No good estimates for global convergence of the basic eigen-solvers have been proved, bu...
متن کاملIndependent Sets with Domination Constraints
A ρ-independent set S in a graph is parameterized by a set ρ of non-negative integers that constrains how the independent set S can dominate the remaining vertices (∀v 6∈ S : |N(v) ∩ S| ∈ ρ.) For all values of ρ, we classify as either NP-complete or polynomial-time solvable the problems of deciding if a given graph has a ρ-independent set. We complement this with approximation algorithms and in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2011
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2011.08.029